Trinomial bases and Chinese remaindering for modular polynomial multiplication
نویسندگان
چکیده
Following the previous work by Bajard-Didier-Kornerup, McLaughlin, Mihailescu and Bajard-Imbert-Jullien, we present an algorithm for modular polynomial multiplication that implements the Montgomery algorithm in a residue basis; here, as in Bajard et al.’s work, the moduli are trinomials over F2. Previous work used a second residue basis to perform the final division. In this paper, we show how to keep the same residue basis, inspired by l’Hospital rule. Additionally, applying a divideand-conquer approach to the Chinese remaindering, we obtain improved estimates on the number of additions for some useful degree ranges.
منابع مشابه
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that splits the minimal polynomial m(z) for the field into linear factors. This makes it possible to develop very fast modular algorithms. We give two output sensitive modular algorithms, one using multiple primes and Chinese re...
متن کاملOn the Number of Trace-One Elements in Polynomial Bases for F2n
This paper investigates the number of trace-one elements in a polynomial basis for F2n . A polynomial basis with a small number of trace-one elements is desirable because it results in an efficient and lowcost implementation of the trace function. We focus on the case where the reduction polynomial is a trinomial or a pentanomial, in which case field multiplication can also be efficiently imple...
متن کاملLow Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
Bit-parallel finite field multiplication in F2m using polynomial basis can be realized in two steps: polynomial multiplication and reduction modulo the irreducible polynomial. In this article, we prove that the modular polynomial reduction can be done with (r − 1)(m − 1) bit additions, where r is the Hamming weight of the irreducible polynomial. We also show that a bit-parallel squaring operati...
متن کاملComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In this article we report on our experience in computing resultants of bivariate polynomials on Graphics Processing Units (GPU). Following the outline of Collins’ modular approach [6], our algorithm starts by mapping the input polynomials to a finite field for sufficiently many primes m. Next, the GPU algorithm evaluates the polynomials at a number of fixed points x ∈ Zm, and computes a set of ...
متن کاملAn FPGA Implementation of a Montgomery Multiplier Over GF(2^m)
This paper describes an efficient FPGA implementation for modular multiplication in the finite field GF(2) that is suitable for implementing Elliptic Curve Cryptosystems. We have developed a systolic array implementation of a Montgomery modular multiplication. Our solution is efficient for large finite fields (m=160-193) that offer a high security level, and it can be scaled easily to larger va...
متن کامل